See undecidable on Wiktionary
{
"antonyms": [
{
"word": "decidable"
}
],
"derived": [
{
"_dis1": "0 0",
"word": "undecidably"
}
],
"etymology_links": [
[
"un-",
"un-#English"
],
[
"decide",
"decide#English"
],
[
"*-dʰlom",
"Reconstruction:Proto-Indo-European/-dʰlom"
],
[
"*-ðlom",
"Reconstruction:Proto-Italic/-ðlom"
],
[
"*-ðlis",
"Reconstruction:Proto-Italic/-ðlis#Proto-Italic:_est"
],
[
"-bilis",
"-bilis#Latin"
],
[
"-ābilis",
"-abilis#Latin:_est"
],
[
"-able",
"-able#Old_French:_est"
],
[
"-able",
"-able#Middle_English:_able_to"
],
[
"-able",
"-able#English"
],
[
"decidable",
"decidable#English"
],
[
"un-",
"un-#English"
],
[
"decidable",
"decidable#English"
]
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": ":af",
"3": "un-",
"4": "decidable",
"text": "+",
"tree": "1"
},
"expansion": "Etymology tree\nEnglish un-\nEnglish decide\nProto-Indo-European *-dʰlom\nProto-Italic *-ðlom\nProto-Italic *-ðlis\nLatin -bilis\nLatin -ābilis\nOld French -ablebor.\nMiddle English -able\nEnglish -able\nEnglish decidable\nEnglish undecidable\n[Appendix:Glossary#loanword|Borrowed]] from\", \"terms\" : [ { \"id\" : \"est\", \"children\" : [ { \"terms\" : [ { \"id\" : \"est\", \"children\" : [ { \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"id\" : \"est\", \"children\" : [ { \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"children\" : [ ], \"lang_name\" : \"Proto-Indo-European\", \"term\" : \"*-dʰlom\", \"status\" : \"missing\", \"lang\" : \"ine-pro\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"Proto-Italic\", \"term\" : \"*-ðlom\", \"status\" : \"ok\", \"lang\" : \"itc-pro\" } ], \"keyword_label\" : \"From\", \"keyword\" : \"from\" } ], \"status\" : \"ok\", \"lang_name\" : \"Proto-Italic\", \"term\" : \"*-ðlis\", \"lang\" : \"itc-pro\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"Latin\", \"term\" : \"-bilis\", \"status\" : \"ok\", \"lang\" : \"la\" } ], \"keyword_label\" : \"From\", \"keyword\" : \"from\" } ], \"status\" : \"ok\", \"lang_name\" : \"Latin\", \"term\" : \"-ābilis\", \"lang\" : \"la\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"status\" : \"ok\", \"lang_name\" : \"Old French\", \"term\" : \"-able\", \"lang\" : \"fro\" } ], \"keyword\" : \"bor\" } ], \"status\" : \"ok\", \"lang_name\" : \"Middle English\", \"term\" : \"-able\", \"lang\" : \"enm\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"English\", \"term\" : \"-able\", \"status\" : \"ok\", \"lang\" : \"en\" } ], \"keyword_label\" : \"From\", \"is_group\" : true, \"keyword\" : \"affix\" } ], \"lang_name\" : \"English\", \"term\" : \"decidable\", \"status\" : \"ok\", \"lang\" : \"en\" } ], \"keyword_label\" : \"From\", \"is_group\" : true, \"keyword\" : \"affix\" } ], \"lang_name\" : \"English\", \"term\" : \"undecidable\", \"status\" : \"ok\", \"lang\" : \"en\" }\" data-lang=\"en\" data-title=\"undecidable\">\nFrom un- + decidable.",
"name": "ety"
}
],
"etymology_text": "Etymology tree\nEnglish un-\nEnglish decide\nProto-Indo-European *-dʰlom\nProto-Italic *-ðlom\nProto-Italic *-ðlis\nLatin -bilis\nLatin -ābilis\nOld French -ablebor.\nMiddle English -able\nEnglish -able\nEnglish decidable\nEnglish undecidable\nFrom un- + decidable.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "undecidable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"_dis1": "0 0",
"word": "noncomputable"
}
],
"senses": [
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [],
"source": "w"
},
{
"_dis": "46 54",
"kind": "other",
"name": "English entries referencing ambiguous etymons",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "56 44",
"kind": "other",
"name": "English entries with etymology texts",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "56 44",
"kind": "other",
"name": "English entries with etymology trees",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "56 44",
"kind": "other",
"name": "English entries with etymon",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "52 48",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English terms prefixed with un-",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "56 44",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Pages using etymon with no ID",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Pages with etymology trees",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Pages with etymon",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Terms with Czech translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Terms with Polish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Terms with Romanian translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Terms with Serbo-Croatian translations",
"parents": [],
"source": "w+disamb"
}
],
"examples": [
{
"bold_text_offsets": [
[
16,
25
],
[
63,
72
],
[
306,
317
],
[
308,
317
],
[
356,
365
],
[
416,
438
],
[
534,
543
],
[
582,
591
],
[
788,
801
],
[
803,
812
]
],
"ref": "1982, Wolfgang Bibel, Automated Theorem Proving, Braunschweig: Friedr. Vieweg & Sohn, →ISBN, page 83:",
"text": "The first-order procedure SP differs from the proposi-\n tional procedure CP°₁ in an essential feature. Namely, CP°₁\n always terminates while SP may run forever as we have seen with\n the example immediately after (3.7). This is not a specific\n defect of SP. Rather it is known that first-order logic is an\n undecidable theory while propositional logic is a decidable\n theory. This means that for the latter there are decision pro-\n cedures which for any formula decide whether it is valid or\n not — and CP°₁ in fact is such a decision procedure — while\n for the former such decision procedures do not exist in princi-\n ple. Thus SP, according to these results for which the reader\n is referred to any logic texts such as [End], [DrG] or [Lew],\n is of the kind which we may expect, it is a semi-decision\n procedure which confirms if a formula is valid but may run\n forever for invalid formulas. Therefore, termination by running\n out of time or space after any finite number of steps will\n leave the question for the validity of a formula unsettled. [...]",
"type": "quotation"
}
],
"glosses": [
"Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"id": "en-undecidable-en-adj-Cc4G40e4",
"links": [
[
"mathematics",
"mathematics"
],
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"algorithm",
"algorithm"
],
[
"finite",
"finite"
],
[
"string",
"string"
],
[
"computer",
"computer"
],
[
"memory",
"memory"
]
],
"raw_glosses": [
"(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"_dis1": "87 13",
"code": "cs",
"lang": "Czech",
"lang_code": "cs",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nerozhodnutelný"
},
{
"_dis1": "87 13",
"code": "fi",
"lang": "Finnish",
"lang_code": "fi",
"sense": "incapable of being algorithmically decided",
"word": "ratkeamaton"
},
{
"_dis1": "87 13",
"code": "de",
"lang": "German",
"lang_code": "de",
"sense": "incapable of being algorithmically decided",
"word": "unentscheidbar"
},
{
"_dis1": "87 13",
"code": "he",
"lang": "Hebrew",
"lang_code": "he",
"roman": "í-karí'a",
"sense": "incapable of being algorithmically decided",
"word": "אי־כריע"
},
{
"_dis1": "87 13",
"code": "pl",
"lang": "Polish",
"lang_code": "pl",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nierozstrzygalny"
},
{
"_dis1": "87 13",
"code": "ro",
"lang": "Romanian",
"lang_code": "ro",
"sense": "incapable of being algorithmically decided",
"word": "nedecidabil"
},
{
"_dis1": "87 13",
"code": "sh",
"lang": "Serbo-Croatian",
"lang_code": "sh",
"sense": "incapable of being algorithmically decided",
"word": "neodlučiv"
},
{
"_dis1": "87 13",
"code": "es",
"lang": "Spanish",
"lang_code": "es",
"sense": "incapable of being algorithmically decided",
"word": "indecidible"
}
]
},
{
"categories": [
{
"kind": "other",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [],
"source": "w"
},
{
"_dis": "46 54",
"kind": "other",
"name": "English entries referencing ambiguous etymons",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "52 48",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English terms prefixed with un-",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Pages using etymon with no ID",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "44 56",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "42 58",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Pages with etymology trees",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Pages with etymon",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Terms with Czech translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "43 57",
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "43 57",
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "42 58",
"kind": "other",
"name": "Terms with Hebrew translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Terms with Polish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Terms with Romanian translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Terms with Serbo-Croatian translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "38 62",
"kind": "other",
"name": "Terms with Spanish translations",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"(of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"id": "en-undecidable-en-adj-7RhXqDqc",
"links": [
[
"mathematics",
"mathematics"
],
[
"WFF",
"WFF"
],
[
"logically independent",
"logically independent"
],
[
"axiom",
"axiom"
]
],
"raw_glosses": [
"(mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
]
}
],
"sounds": [
{
"audio": "en-us-undecidable.ogg",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/5d/En-us-undecidable.ogg/En-us-undecidable.ogg.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/5/5d/En-us-undecidable.ogg",
"tags": [
"US"
]
}
],
"word": "undecidable"
}
{
"antonyms": [
{
"word": "decidable"
}
],
"categories": [
"English adjectives",
"English entries referencing ambiguous etymons",
"English entries with etymology texts",
"English entries with etymology trees",
"English entries with etymon",
"English entries with incorrect language header",
"English lemmas",
"English terms prefixed with un-",
"English uncomparable adjectives",
"Entries with translation boxes",
"Pages using etymon with no ID",
"Pages with 1 entry",
"Pages with entries",
"Pages with etymology trees",
"Pages with etymon",
"Terms with Czech translations",
"Terms with Finnish translations",
"Terms with German translations",
"Terms with Hebrew translations",
"Terms with Polish translations",
"Terms with Romanian translations",
"Terms with Serbo-Croatian translations",
"Terms with Spanish translations"
],
"derived": [
{
"word": "undecidably"
}
],
"etymology_links": [
[
"un-",
"un-#English"
],
[
"decide",
"decide#English"
],
[
"*-dʰlom",
"Reconstruction:Proto-Indo-European/-dʰlom"
],
[
"*-ðlom",
"Reconstruction:Proto-Italic/-ðlom"
],
[
"*-ðlis",
"Reconstruction:Proto-Italic/-ðlis#Proto-Italic:_est"
],
[
"-bilis",
"-bilis#Latin"
],
[
"-ābilis",
"-abilis#Latin:_est"
],
[
"-able",
"-able#Old_French:_est"
],
[
"-able",
"-able#Middle_English:_able_to"
],
[
"-able",
"-able#English"
],
[
"decidable",
"decidable#English"
],
[
"un-",
"un-#English"
],
[
"decidable",
"decidable#English"
]
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": ":af",
"3": "un-",
"4": "decidable",
"text": "+",
"tree": "1"
},
"expansion": "Etymology tree\nEnglish un-\nEnglish decide\nProto-Indo-European *-dʰlom\nProto-Italic *-ðlom\nProto-Italic *-ðlis\nLatin -bilis\nLatin -ābilis\nOld French -ablebor.\nMiddle English -able\nEnglish -able\nEnglish decidable\nEnglish undecidable\n[Appendix:Glossary#loanword|Borrowed]] from\", \"terms\" : [ { \"id\" : \"est\", \"children\" : [ { \"terms\" : [ { \"id\" : \"est\", \"children\" : [ { \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"id\" : \"est\", \"children\" : [ { \"terms\" : [ { \"children\" : [ { \"terms\" : [ { \"children\" : [ ], \"lang_name\" : \"Proto-Indo-European\", \"term\" : \"*-dʰlom\", \"status\" : \"missing\", \"lang\" : \"ine-pro\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"Proto-Italic\", \"term\" : \"*-ðlom\", \"status\" : \"ok\", \"lang\" : \"itc-pro\" } ], \"keyword_label\" : \"From\", \"keyword\" : \"from\" } ], \"status\" : \"ok\", \"lang_name\" : \"Proto-Italic\", \"term\" : \"*-ðlis\", \"lang\" : \"itc-pro\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"Latin\", \"term\" : \"-bilis\", \"status\" : \"ok\", \"lang\" : \"la\" } ], \"keyword_label\" : \"From\", \"keyword\" : \"from\" } ], \"status\" : \"ok\", \"lang_name\" : \"Latin\", \"term\" : \"-ābilis\", \"lang\" : \"la\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"status\" : \"ok\", \"lang_name\" : \"Old French\", \"term\" : \"-able\", \"lang\" : \"fro\" } ], \"keyword\" : \"bor\" } ], \"status\" : \"ok\", \"lang_name\" : \"Middle English\", \"term\" : \"-able\", \"lang\" : \"enm\" } ], \"keyword_label\" : \"Inherited from\", \"keyword\" : \"inherited\" } ], \"lang_name\" : \"English\", \"term\" : \"-able\", \"status\" : \"ok\", \"lang\" : \"en\" } ], \"keyword_label\" : \"From\", \"is_group\" : true, \"keyword\" : \"affix\" } ], \"lang_name\" : \"English\", \"term\" : \"decidable\", \"status\" : \"ok\", \"lang\" : \"en\" } ], \"keyword_label\" : \"From\", \"is_group\" : true, \"keyword\" : \"affix\" } ], \"lang_name\" : \"English\", \"term\" : \"undecidable\", \"status\" : \"ok\", \"lang\" : \"en\" }\" data-lang=\"en\" data-title=\"undecidable\">\nFrom un- + decidable.",
"name": "ety"
}
],
"etymology_text": "Etymology tree\nEnglish un-\nEnglish decide\nProto-Indo-European *-dʰlom\nProto-Italic *-ðlom\nProto-Italic *-ðlis\nLatin -bilis\nLatin -ābilis\nOld French -ablebor.\nMiddle English -able\nEnglish -able\nEnglish decidable\nEnglish undecidable\nFrom un- + decidable.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "undecidable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "noncomputable"
}
],
"senses": [
{
"categories": [
"English terms with quotations",
"en:Mathematics",
"en:Theory of computing"
],
"examples": [
{
"bold_text_offsets": [
[
16,
25
],
[
63,
72
],
[
306,
317
],
[
308,
317
],
[
356,
365
],
[
416,
438
],
[
534,
543
],
[
582,
591
],
[
788,
801
],
[
803,
812
]
],
"ref": "1982, Wolfgang Bibel, Automated Theorem Proving, Braunschweig: Friedr. Vieweg & Sohn, →ISBN, page 83:",
"text": "The first-order procedure SP differs from the proposi-\n tional procedure CP°₁ in an essential feature. Namely, CP°₁\n always terminates while SP may run forever as we have seen with\n the example immediately after (3.7). This is not a specific\n defect of SP. Rather it is known that first-order logic is an\n undecidable theory while propositional logic is a decidable\n theory. This means that for the latter there are decision pro-\n cedures which for any formula decide whether it is valid or\n not — and CP°₁ in fact is such a decision procedure — while\n for the former such decision procedures do not exist in princi-\n ple. Thus SP, according to these results for which the reader\n is referred to any logic texts such as [End], [DrG] or [Lew],\n is of the kind which we may expect, it is a semi-decision\n procedure which confirms if a formula is valid but may run\n forever for invalid formulas. Therefore, termination by running\n out of time or space after any finite number of steps will\n leave the question for the validity of a formula unsettled. [...]",
"type": "quotation"
}
],
"glosses": [
"Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"algorithm",
"algorithm"
],
[
"finite",
"finite"
],
[
"string",
"string"
],
[
"computer",
"computer"
],
[
"memory",
"memory"
]
],
"raw_glosses": [
"(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"(of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"links": [
[
"mathematics",
"mathematics"
],
[
"WFF",
"WFF"
],
[
"logically independent",
"logically independent"
],
[
"axiom",
"axiom"
]
],
"raw_glosses": [
"(mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
]
}
],
"sounds": [
{
"audio": "en-us-undecidable.ogg",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/5d/En-us-undecidable.ogg/En-us-undecidable.ogg.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/5/5d/En-us-undecidable.ogg",
"tags": [
"US"
]
}
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"lang_code": "cs",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nerozhodnutelný"
},
{
"code": "fi",
"lang": "Finnish",
"lang_code": "fi",
"sense": "incapable of being algorithmically decided",
"word": "ratkeamaton"
},
{
"code": "de",
"lang": "German",
"lang_code": "de",
"sense": "incapable of being algorithmically decided",
"word": "unentscheidbar"
},
{
"code": "he",
"lang": "Hebrew",
"lang_code": "he",
"roman": "í-karí'a",
"sense": "incapable of being algorithmically decided",
"word": "אי־כריע"
},
{
"code": "pl",
"lang": "Polish",
"lang_code": "pl",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nierozstrzygalny"
},
{
"code": "ro",
"lang": "Romanian",
"lang_code": "ro",
"sense": "incapable of being algorithmically decided",
"word": "nedecidabil"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"lang_code": "sh",
"sense": "incapable of being algorithmically decided",
"word": "neodlučiv"
},
{
"code": "es",
"lang": "Spanish",
"lang_code": "es",
"sense": "incapable of being algorithmically decided",
"word": "indecidible"
}
],
"word": "undecidable"
}
Download raw JSONL data for undecidable meaning in All languages combined (8.8kB)
{
"called_from": "parser/1336",
"msg": "no corresponding start tag found for </span>",
"path": [
"undecidable"
],
"section": "English",
"subsection": "adjective",
"title": "undecidable",
"trace": ""
}
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2026-09-28 from the enwiktionary dump dated 2026-09-02 using wiktextract (1a05e46 and e3d6d4e). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.